L1 shortest path queries in simple polygons
نویسندگان
چکیده
منابع مشابه
Shortest Inspection-Path Queries in Simple Polygons
We want to preprocess a simple n-vertex polygon P to quickly determine the shortest path from a fixed source point s ∈ P to some point visible from a query point q ∈ P . We call such queries inspection-path queries. We give an algorithm that computes a data structure which answers the queries in logarithmic time. The data structure has O(n) size and can be computed in O(n logn) time.
متن کاملOptimal Shortest Path and Minimum-Link Path Queries Between Two Convex Polygons Inside a Simple Polygonal Obstacle
We present e cient algorithms for shortest path and minimum link path queries between two convex polygons inside a simple polygon P which acts as an obstacle to be avoided Let n be the number of vertices of P and h the total number of vertices of the query polygons We show that shortest path queries can be performed optimally in time O logh logn plus O k time for reporting the k edges of the pa...
متن کاملOptimal Shortest Path and Minimum-link Path Queries between Two Convex Polygons in the Presence of Obstacles Optimal Shortest Path and Minimum-link Path Queries between Two Convex Polygons in the Presence of Obstacles
We present eecient algorithms for shortest-path and minimum-link-path queries between two convex polygons inside a simple polygon P, which acts as an obstacle to be avoided. Let n be the number of vertices of P, and h the total number of vertices of the query polygons. We show that shortest-path queries can be performed optimally in time O(log h + logn) (plus O(k) time for reporting the k edges...
متن کاملVisibility Queries in Simple Polygons and Applications
In this paper we explore some novel aspects of visibility for stationary and moving points inside a simple polygon P . We provide a mechanism for expressing the visibility polygon from a point as the disjoint union of logarithmically many canonical pieces using a quadratic-space data structure. This allows us to report visibility polygons in time proportional to their size, but without the cubi...
متن کاملWeak Visibility Queries in Simple Polygons
In this paper, we consider the problem of computing the weak visibility (WV ) of a query line segment inside a simple polygon. Our algorithm first preprocesses the polygon and creates data structures from which any WV query is answered efficiently in an output sensitive manner. In our solution, the preprocessing is performed in time O(n log n) and the size of the constructed data structure is O...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2019
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2019.04.023